An efficient approximation to the Cauchy radius

Abstract The Cauchy radius of a scalar polynomial is an upper bound on the magnitude its zeros, and it optimal among all bounds depending only moduli coefficients. It has disadvantage being implicit because requires solution nonlinear equation. In this note, simple explicit are derived that useful approximations to radius. general approach obtain aforementioned embed polynomials into larger framework their generalization matrix then use eigenvalues latter.